Near-Optimal Parameterization of the Intersection of Quadrics : II A classification of Pencils
Identifieur interne : 005E26 ( Main/Exploration ); précédent : 005E25; suivant : 005E27Near-Optimal Parameterization of the Intersection of Quadrics : II A classification of Pencils
Auteurs : Laurent Dupont ; Daniel Lazard ; Sylvain Lazard ; Sylvain PetitjeanSource :
English descriptors
- KwdEn :
Abstract
While Part I [2] of this paper was devoted mainly to quadrics intersecting in a smooth quartic, we now focus on singular intersections. To produce optimal or near-optimal parameterizations in all cases, we first determine the the real type of the intersection before computing the actual parameterization. In this second part, we present the first classification of pencils of quadrics based on the type of the real intersection and we show how this classification can be used to compute efficiently the type of the real intersection. The near-optimal parameterization algorithms in all singular cases will be given in Part III [3].
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 004310
- to stream Crin, to step Curation: 004310
- to stream Crin, to step Checkpoint: 000274
- to stream Main, to step Merge: 006049
- to stream Main, to step Curation: 005E26
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="392">Near-Optimal Parameterization of the Intersection of Quadrics : II A classification of Pencils</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:dupont05b</idno>
<date when="2005" year="2005">2005</date>
<idno type="wicri:Area/Crin/Corpus">004310</idno>
<idno type="wicri:Area/Crin/Curation">004310</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">004310</idno>
<idno type="wicri:Area/Crin/Checkpoint">000274</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000274</idno>
<idno type="wicri:Area/Main/Merge">006049</idno>
<idno type="wicri:Area/Main/Curation">005E26</idno>
<idno type="wicri:Area/Main/Exploration">005E26</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Near-Optimal Parameterization of the Intersection of Quadrics : II A classification of Pencils</title>
<author><name sortKey="Dupont, Laurent" sort="Dupont, Laurent" uniqKey="Dupont L" first="Laurent" last="Dupont">Laurent Dupont</name>
</author>
<author><name sortKey="Lazard, Daniel" sort="Lazard, Daniel" uniqKey="Lazard D" first="Daniel" last="Lazard">Daniel Lazard</name>
</author>
<author><name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name>
</author>
<author><name sortKey="Petitjean, Sylvain" sort="Petitjean, Sylvain" uniqKey="Petitjean S" first="Sylvain" last="Petitjean">Sylvain Petitjean</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>classification</term>
<term>curve parameterization</term>
<term>intersection of surfaces</term>
<term>pencils of quadrics</term>
<term>quadrics</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="2148">While Part I [2] of this paper was devoted mainly to quadrics intersecting in a smooth quartic, we now focus on singular intersections. To produce optimal or near-optimal parameterizations in all cases, we first determine the the real type of the intersection before computing the actual parameterization. In this second part, we present the first classification of pencils of quadrics based on the type of the real intersection and we show how this classification can be used to compute efficiently the type of the real intersection. The near-optimal parameterization algorithms in all singular cases will be given in Part III [3].</div>
</front>
</TEI>
<affiliations><list></list>
<tree><noCountry><name sortKey="Dupont, Laurent" sort="Dupont, Laurent" uniqKey="Dupont L" first="Laurent" last="Dupont">Laurent Dupont</name>
<name sortKey="Lazard, Daniel" sort="Lazard, Daniel" uniqKey="Lazard D" first="Daniel" last="Lazard">Daniel Lazard</name>
<name sortKey="Lazard, Sylvain" sort="Lazard, Sylvain" uniqKey="Lazard S" first="Sylvain" last="Lazard">Sylvain Lazard</name>
<name sortKey="Petitjean, Sylvain" sort="Petitjean, Sylvain" uniqKey="Petitjean S" first="Sylvain" last="Petitjean">Sylvain Petitjean</name>
</noCountry>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005E26 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 005E26 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= CRIN:dupont05b |texte= Near-Optimal Parameterization of the Intersection of Quadrics : II A classification of Pencils }}
This area was generated with Dilib version V0.6.33. |